Variance Minimization – Relationship between Completion-Time Variance and Waiting-Time Variance
نویسندگان
چکیده
منابع مشابه
New Results on the Completion Time Variance Minimization
A single machine scheduling problem where the objective is to minimize the variance of job completion times is considered. The model is applicable to many environments where it is desirable to provide jobs, customers or computer files, with approximately the same service. It is shown that the problem can be formulated as a problem of maximizing a zeroone quadratic function which is a submodular...
متن کاملWaiting Time Variance in Polling Systems
In this paper, we develop a general expression for the second moment of waiting time for polling systems with either an exhaustive or gated service policy. We obtain a closed form expression for the second moment of waiting time for the special case of systems with two identical stations. This result is used to show that the behavior of the first two moments can be very different. Specifically,...
متن کاملJob scheduling methods for reducing waiting time variance
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of their waiting times is minimized. Minimizing WTV is a well known scheduling problem, important in providing Quality of Service (QoS) in many industries. Minimizing the variance of job waiting times on computer networks can...
متن کاملMinimizing Class-Based Completion Time Variance on a single machine
⎯We consider the problem of scheduling a set of simultaneously available jobs on a single machine. The objective is to determine a schedule that minimizes the class-based completion time variance (CB-CTV) of the jobs while reducing the overall CTV is taken as the secondary objective. This non-regular performance measure is closely related to service stability and of practical significance in ma...
متن کاملA Lower Bound for the Weighted Completion Time Variance Problem
We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than 2000 instances shows that this lower bound is very tight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1996
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000000503